//
// Created by 下次一定 on 2021/9/3.
//

#include<iostream>
using namespace std;

const int N = 1e6 + 10;
int n,m;
int q[N];

int main(){
    scanf("%d%d",&n,&m);

    for(int i = 0;i < n;i++) scanf("%d",&q[i]);

    while(m--){
        int x;
        scanf("%d",&x);

        //找左端
        int l = 0, r = n-1;
        while(l < r){
            int mid =l + r >>1;
            if(q[mid]>=x) r = mid;
            else l = mid +1;
        }

        if(q[l]!=x) cout<<"-1 -1";
        else{
            cout<<l<<" ";
            l = 0,r = n-1;
            //找右端
            while(l < r){
                int mid = l + r + 1 >>1;
                if(q[mid]<=x)l=mid;
                else r=mid-1;
            }
            cout<<l;
        }

    }
}